Dynamic Priority Inversion Avoidance in Real-Time Operating Systems

نویسندگان

  • I-Hsuan Huang
  • Chun-Yen Yu
  • Yu-Chan Chung
  • Cheng-Zen Yang
چکیده

One of the most important design goals in a real-time system is to guarantee that all tasks can finish their work before reaching deadline. However, the sequence of resource allocation among tasks of different priorities may result in a severe priority inversion problem such that a high priority task will violate its deadline requirement. Although previous solutions can shorten the latency resulted from the inversion, they do not address how to avoid the occurrence of priority inversion. In this paper, we propose a dynamic priority inversion avoidance mechanism to avoid the priority inversion. According to the simulation results, the proposed mechanism can guarantee the real-time requirements of the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Control for Dynamic Priority Distributed Real - Time Systems

Many of today’s complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this demand, the Object Management Group’s (OMG) Real-Time Special Interest Group (RT SIG) has worked to extend the Common Object Request Broker Architecture (CORBA) standard to include real-time specifications. This group’s most r...

متن کامل

The Priority Ceiling Protocol: Formalization and Analysis Using PVS∗

Common real-time operating systems rely on priority-based, preemptive scheduling. Resource sharing in such systems potentially leads to priority inversion: processes of high priority can be prevented from entering a critical section and be delayed by processes of lower priority. Since uncontrolled priority inversion can cause high-priority processes to miss their deadlines, a real-time operatin...

متن کامل

On Using Priority Inheritance In Real-Time Databases

Due to resource sharing among tasks, priority inversion can occur during prioritydriven preemptive scheduling. In this work, we investigate solutions to the priority inversion problem in a real-time database environment where two-phase locking is employed for concurrency control. We examine two basic schemes for addressing the priority inversion problem, one based on priority inheritance and th...

متن کامل

Preemptibility in Real-Time Operating Systems

Real-time operating systems generally depend on some form of priority information for making scheduling decisions. Priorities may take the form of small integers or deadline times, for example, and the priorities indicate the preferred order for execution of the jobs. Unfortunately, most systems suffer from some degree of priority inversion where a high priority job must wait for a lower priori...

متن کامل

Resource Sharing in Reservation-Based Systems

In recent years, real-time operating systems began to support the resource reservation paradigm. This technique has proved to be very effective in providing QoS to both, real-time and legacy applications, ensuring that the temporal misbehavior of an application does not affect any other (temporal isolation). However, resource sharing in a reservation system is still not well understood, and can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009